#include <bits/stdc++.h>
#include <bits/stdc++.h>


using namespace std;

namespace yzy {

	int a = 10;
}



#include<bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
const int N = 2e5 + 10;
#define INF 0x3f3f3f3f;
typedef long long int ll;
#define close(); std::ios::sync_with_stdio(false);cin.tie(0),cout.tie(0);
//----------------------------------------------------------------------------//
//
int compare1(const void* a, const void* b)
{
    return (*(int*)a - *(int*)b);
}
//
int compare2(const void* a, const void* b)
{
    return (*(int*)b - *(int*)a);
}


int main()
{
    close();

    int a[6] = { 25, 777, 11, 21, 65, 43 };

    qsort(a, 6, sizeof(int), compare1);

    for (int i = 0; i < sizeof(a) / sizeof(a[0]); i++) cout << a[i] << " ";
    cout << '\n';

    return 0;
}



#include<bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
const int N = 2e5 + 10;
#define INF 0x3f3f3f3f;
typedef long long int ll;
#define close(); std::ios::sync_with_stdio(false);cin.tie(0),cout.tie(0);
//----------------------------------------------------------------------------//
//
int compare1(const void* a, const void* b)
{
    return (*(int*)a - *(int*)b);
}
//
int compare2(const void* a, const void* b)
{
    return (*(int*)b - *(int*)a);
}


int main()
{

    int a[6] = { 25, 777, 11, 21, 65, 43 };

    qsort(a, 6, sizeof(int), compare1);

    for (int i = 0; i < sizeof(a) / sizeof(a[0]); i++) cout << a[i] << " ";
    cout << '\n';

    return 0;
}